The all-to-all alternative route problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The all-organic route to doping graphene

New materials that promise to improve electronic devices often inspire great enthusiasm. After all, there is the possibility that they will revolutionize the way we build computers, transmit electricity, illuminate houses, make flat-panel displays, and so on. But the truth is that it takes a great deal of time and painstaking work to put these materials to practical use and make them commonplac...

متن کامل

A salty route to an all-nitrogen ring.

Elusive three-body matters Tunable interactions make dilute atomic gases ideal for studying the collective dynamics of many-body systems. If the gas consists of strongly interacting fermions evenly divided into two groups of opposite spin, many of its properties can be distilled to two-body correlations. Fletcher et al. show that this does not hold for a gas of bosons, where identical particles...

متن کامل

All Things to All People

Myc is an enigma wrapped in a mystery. Attempts to identify Myc target genes, particularly in cancer, have been fraught with dead ends and context-specific functions. Lin et al. and Nie et al. address this conundrum by showing that Myc acts to amplify the output of existing transcriptionally active genes.

متن کامل

A New Method to Find All Alternative Extreme Optimal Points for Linear Programming Problem

The problem of linear programming (LP) is one of the earliest formulated problems in mathematical programming where a linear function has to be maximized (minimized) over a convex constraint polyhedron X. The simplex algorithm was early suggested for solving this problem by moving toward a solution on the exterior of the constraint polyhedron X. In 1984, the area of linear programming underwent...

متن کامل

All Colors Shortest Path Problem

All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to general...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Operations Research

سال: 1993

ISSN: 0399-0559,1290-3868

DOI: 10.1051/ro/1993270403751